A triangle-based $C^1$ interpolation method

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Triangle-based Method for Scattered Data Interpolation

Local numerical methods for scattered data interpolation often require a smart subdivision of the domain in geometrical polyhedral structures. In particular triangulations in the plane (2D) and tetrahedrizations in the space (3D) are widely used to define interpolation models. In this paper we give a short survey on the main methods for the scattered data problem and we recall preliminaries on ...

متن کامل

Triangle-Based View Interpolation without Depth-Buffering

In this paper, we propose a triangle-based view interpolation algorithm which can correctly resolve the visibility problem without depth-buffering. The algorithm is especially useful when depth information is not available, such as in the case of real-world photographs. By subdividing the reference image into variable-sized triangles, view interpolation can be done efficiently using existing gr...

متن کامل

A local Lagrange interpolation method based on C1 cubic splines on Freudenthal partitions

A trivariate Lagrange interpolation method based on C cubic splines is described. The splines are defined over a special refinement of the Freudenthal partition of a cube partition. The interpolating splines are uniquely determined by data values, but no derivatives are needed. The interpolation method is local and stable, provides optimal order approximation, and has linear complexity.

متن کامل

Constrained C1 Interpolation on Rectangular Grids

.This paper is concerned with the range restricted interpolation of 'data on rectangular grids. The interpolant is constrained to lie on the same side of the constraint surface as the data. Sufficient non-negativity conditions on the Bezier ordinates are derived to ensure the non-negativity of a bicubic Bezier patch. The method modifies Bezier ordinates locally to fulfill the sufficient non-neg...

متن کامل

On Convexity Preserving C1 Hermite Spline Interpolation

The aim of this paper is to present a general approach to the problem of shape preserving interpolation. The problem of convexity preserving interpolation using C Hermite splines with one free generating function is considered.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Rocky Mountain Journal of Mathematics

سال: 1984

ISSN: 0035-7596

DOI: 10.1216/rmj-1984-14-1-223